Minimal Linear Codes From Characteristic Functions
نویسندگان
چکیده
منابع مشابه
On Minimal and Almost-Minimal Linear Codes
Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...
متن کاملVariations on Minimal Linear Codes
Minimal linear codes are linear codes such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing. We pursue here their study and construct asymptotically good families of minimal linear codes. We also push further the study of quasi-minimal and almost-minimal linear codes, re...
متن کاملCryptographical Boolean Functions Construction from Linear Codes
This paper presents an extension of the Maiorana-McFarland method for building Boolean functions with good cryptographic properties. The original Maiorana-McFarland construction was proposed to design bent functions. Then, it was extended in [1] to build highly nonlinear resilient functions. The classical construction splits the set of variables into two separate subsets. There, is proposed a d...
متن کاملMinimal Linear Codes over Finite Fields
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that wmin/wmax > (q− 1)/q is a sufficient condition for a linear code over the finite field ...
متن کاملBounds on Minimal Codewords in Linear Codes
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal code-words are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every weight class between the two bounds contains at least one minimal codeword and at least one non-mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2978387